Lower Bounds for Complementation of ω-Automata via the Full Automata Technique

In this paper, we first introduce a new lower bound technique for the state complexity of transformations of automata. Namely we suggest considering the class of full automata in lower bound analysis. Then we apply such technique to the complementation of nondeterministic ωautomata and obtain several lower bound results. Particularly, we prove anΩ((0.76n)) lower bound for Büchi complementation, which also holds for almost every complementation and determinization transformation of nondeterministic ω-automata, and prove an optimal (Ω(nk)) lower bound for the complementation of generalized Büchi automata, which holds for Streett automata as well.